The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

cond(true, x, y) → cond(and(gr(x, 0), gr(y, 0)), p(x), p(y))
and(true, true) → true
and(x, false) → false
and(false, x) → false
gr(0, 0) → false
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
p(0) → 0
p(s(x)) → x

Rewrite Strategy: FULL

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

cond(true, x, y) → cond(and(gr(x, 0'), gr(y, 0')), p(x), p(y))
and(true, true) → true
and(x, false) → false
and(false, x) → false
gr(0', 0') → false
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
p(0') → 0'
p(s(x)) → x

S is empty.
Rewrite Strategy: FULL

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

TRS:
Rules:
cond(true, x, y) → cond(and(gr(x, 0'), gr(y, 0')), p(x), p(y))
and(true, true) → true
and(x, false) → false
and(false, x) → false
gr(0', 0') → false
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond :: true:false → 0':s → 0':s → cond
true :: true:false
and :: true:false → true:false → true:false
gr :: 0':s → 0':s → true:false
0' :: 0':s
p :: 0':s → 0':s
false :: true:false
s :: 0':s → 0':s
hole_cond1_0 :: cond
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
cond, gr

They will be analysed ascendingly in the following order:
gr < cond

(6) Obligation:

TRS:
Rules:
cond(true, x, y) → cond(and(gr(x, 0'), gr(y, 0')), p(x), p(y))
and(true, true) → true
and(x, false) → false
and(false, x) → false
gr(0', 0') → false
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond :: true:false → 0':s → 0':s → cond
true :: true:false
and :: true:false → true:false → true:false
gr :: 0':s → 0':s → true:false
0' :: 0':s
p :: 0':s → 0':s
false :: true:false
s :: 0':s → 0':s
hole_cond1_0 :: cond
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))

The following defined symbols remain to be analysed:
gr, cond

They will be analysed ascendingly in the following order:
gr < cond

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

Induction Base:
gr(gen_0':s4_0(0), gen_0':s4_0(0)) →_R^Ω(1)
false

Induction Step:
gr(gen_0':s4_0(+(n6_0, 1)), gen_0':s4_0(+(n6_0, 1))) →_R^Ω(1)
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) →_IH
false

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

TRS:
Rules:
cond(true, x, y) → cond(and(gr(x, 0'), gr(y, 0')), p(x), p(y))
and(true, true) → true
and(x, false) → false
and(false, x) → false
gr(0', 0') → false
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond :: true:false → 0':s → 0':s → cond
true :: true:false
and :: true:false → true:false → true:false
gr :: 0':s → 0':s → true:false
0' :: 0':s
p :: 0':s → 0':s
false :: true:false
s :: 0':s → 0':s
hole_cond1_0 :: cond
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

Lemmas:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))

The following defined symbols remain to be analysed:
cond

(10) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol cond.

(11) Obligation:

TRS:
Rules:
cond(true, x, y) → cond(and(gr(x, 0'), gr(y, 0')), p(x), p(y))
and(true, true) → true
and(x, false) → false
and(false, x) → false
gr(0', 0') → false
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond :: true:false → 0':s → 0':s → cond
true :: true:false
and :: true:false → true:false → true:false
gr :: 0':s → 0':s → true:false
0' :: 0':s
p :: 0':s → 0':s
false :: true:false
s :: 0':s → 0':s
hole_cond1_0 :: cond
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

Lemmas:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))

No more defined symbols left to analyse.

(12) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

(13) BOUNDS(n^1, INF)

(14) Obligation:

TRS:
Rules:
cond(true, x, y) → cond(and(gr(x, 0'), gr(y, 0')), p(x), p(y))
and(true, true) → true
and(x, false) → false
and(false, x) → false
gr(0', 0') → false
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond :: true:false → 0':s → 0':s → cond
true :: true:false
and :: true:false → true:false → true:false
gr :: 0':s → 0':s → true:false
0' :: 0':s
p :: 0':s → 0':s
false :: true:false
s :: 0':s → 0':s
hole_cond1_0 :: cond
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

Lemmas:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
gr(gen_0':s4_0(n6_0), gen_0':s4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

(16) BOUNDS(n^1, INF)